Boolean Algebras and Distributive Lattices Treated Constructively

نویسنده

  • John L. Bell
چکیده

Some aspects of the theory of Boolean algebras and distributive lattices -in particular, the Stone Representation Theorems and the properties of filters and ideals -are analyzed in a constructive setting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profinite Heyting Algebras and Profinite Completions of Heyting Algebras

This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...

متن کامل

Discrete duality and its application to bounded lattices with operators

Duality theory emerged from the work by Marshall Stone [18] on Boolean algebras and distributive lattices in the 1930s. Later in the early 1970s Larisa Maksimova [10, 11] and Hilary Priestley [15, 16] developed analogous results for Heyting algebras, topological Boolean algebras, and distributive lattices. Duality for bounded, not necessarily distributive lattices, was developed by Alstir Urquh...

متن کامل

On Recovering a Bounded Distributive Lattice from Its Endomorphism Monoid

The sub algebra functor Sub A is faithful for Boolean algebras (Sub A •Sub B implies A • B, see D. Sachs [7] ), but it is not faithful for bounded distributive lattices or unbounded distributive lattices. The automorphism functor Aut A is highly unfaithful even for Boolean algebras. The endomorphism functor End A is the most faithful of all three. B. M. Schein [8] and K. D.' Magill [5] establis...

متن کامل

Reductions and Algorithms for Lattices with Complements

We present tractable algorithms for deciding the universal theories of lattices with different notions of complementation by reduction to more standard procedures. The reductions use basic structural properties of lattices. For Boolean algebras, generalised Boolean algebras and atomic distributive lattices we reduce to SAT-procedures. For Brouwerian algebras we reduce to the uniform word proble...

متن کامل

OPTIMAL NATURAL DUALITIES FOR SOME QUASIVARIETIES OF DISTRIBUTIVE DOUBLE p–ALGEBRAS

Quasivarieties of distributive double p-algebras generated by an ordinal sum M of two Boolean lattices are considered. Globally minimal failsets within S(M2) are completely determined; from them all the optimal dualities for these quasivarieties are obtained.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Log. Q.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999